منابع مشابه
The Role and Meaning of Predicative and Non-Predicative Definitions in the Search for Information
Borrowings and Adaptations. First of all, the author would like to clarify the meanings of the terms "predicative" and "nonpredicative". As is well known, praedicatum in Late Latin means "what has been said (previously)". In Aristotelian and subsequent forms of traditional logic [8,9,11,12,13,14,15,16] a predicate was understood to be one (the one in which something is said about the subject of...
متن کاملFrom Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...
متن کاملMode Directed Path Finding
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the area of multi-relational concept learning. However, hill-climbing heuristics are susceptible to local maxima and plateaus. In this paper, we sh...
متن کاملDirected Path Graphs
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph → Pk(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k vertices in D. Several properties of → P3(...
متن کاملSpecial asteroidal quadruple on directed path graph non rooted path graph
An asteroidal triple in a graph G is a set of three nonadjacent vertices such that for any two of them there exists a path between them that does not intersect the neighborhood of the third. Special asteroidal triple in a graph G is an asteroidal triple such that each pair is linked by a special connection. A special asteroidal triples play a central role in a characterization of directed path ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nordlyd
سال: 2007
ISSN: 1503-8599
DOI: 10.7557/12.80